Capacity Analysis of LEO Mega-Constellation Networks

This paper proposes a complete network capacity analysis framework for low-earth-orbit (LEO) mega-constellations, where estimation problem considering the link packet loss rate is formulated with support of time-variant topology model and task distribution model. solved in two steps. First, without rate, an improved fully polynomial-time approximation (IFPTA) algorithm proposed to provide sub-optimal solution multi-commodity flow (MCF) problem, which simpler definition commodity given proved be equivalent original problem. Second, Jackson-network-based fallback approach control below threshold. Numerical results illustrate superiority IFPTA terms accuracy time complexity compared existing solutions. In addition, characteristics mega-constellations are analyzed by utilizing framework, including relationship between constellation size capacity, bottlenecks, influence distributions.